Affine hyperplane arrangements and Jordan classes
نویسندگان
چکیده
منابع مشابه
Affine and Toric Hyperplane Arrangements
We extend the Billera–Ehrenborg–Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky’s fundamental results on the number of regions.
متن کاملGrothendieck Classes and Chern Classes of Hyperplane Arrangements
We show that the characteristic polynomial of a hyperplane arrangement can be recovered from the class in the Grothendieck group of varieties of the complement of the arrangement. This gives a quick proof of a theorem of Orlik and Solomon relating the characteristic polynomial with the ranks of the cohomology of the complement of the arrangement. We also show that the characteristic polynomial ...
متن کاملMatroid Shellability , β - Systems and Affine Hyperplane Arrangements
The broken circuit complex plays a fundamental role for the shellability and homology of matroids, geometric lattices and linear hyperplane arrangements. Here we introduce and study the β-system of a matroid, βnbc(M), whose cardinality is Crapo’s β-invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices and affine hyperplane arrangements, we find th...
متن کاملFf Ur Mathematik in Den Naturwissenschaften Leipzig Hyperplane Arrangements Separating Arbitrary Vertex Classes in N-cubes Hyperplane Arrangements Separating Arbitrary Vertex Classes in N-cubes
Strictly layered feedforward networks with binary neurons are viewed as maps from the vertex set of an n cube to the vertex set of an l cube With only one output neuron in principle they can realize any Boolean function on n inputs We address the problem of determining the necessary and su cient numbers of hidden units for this task by using separability properties of a ne oriented hyperplane a...
متن کاملRandom Walk and Hyperplane Arrangements
Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Algebra
سال: 2020
ISSN: 2415-6302
DOI: 10.4171/jca/48